The (1,2)-step competition graph of a pure local tournament that is not round decomposable
نویسندگان
چکیده
منابع مشابه
The (1, 2)-step competition graph of a tournament
The competition graph of a digraph, introduced by Cohen in 1968, has been extensively studied. More recently, in 2000, Cho, Kim and Nam defined the m-step competition graph. Here, we offer another generalization of the competition graph. We define the (1,2)-step competition graph of a digraph D, denoted C1,2(D) , as the graph of V(D) where {x,y} is an element of E(C1,2(D)) if and only if there ...
متن کاملA note on the existence of edges in the (1, 2)-step competition graph of a round digraph
Factor and Merz [Discrete Appl. Math. 159 (2011), 100–103] defined the (1, 2)-step competition graph and studied the (1, 2)-step competition graph of a tournament. In this paper, a sufficient and necessary condition for any two vertices to be adjacent in the (1, 2)-step competition graph C1,2(D) of a round digraph D is given. 1 Terminology and Introduction The competition graph of a digraph, in...
متن کاملNot-Sampled Issue and Round-Replacement Tournament Selection
The standard tournament selection samples individuals with replacement. The sampling-with-replacement strategy has its advantages but also has issues. One of the commonly recognised issues is that it is possible to have some individuals not sampled at all during the selection phase. The not-sampled issue aggravates the loss of diversity. However, it is not clear how the issue affects GP search....
متن کاملThe m-step competition graph of a digraph
The competition graph of a digraph was introduced by Cohen in 1968 associated with the study of ecosystems. Since then, the competition graph has been widely studied and many variations have been introduced. In this paper, we de ne and study the m-step competition graph of a digraph which is another generalization of competition graph. ? 2000 Elsevier Science B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.12.013